By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 20, Issue 5, pp. 807-998

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Maximum Size of Dynamic Data Structures

Claire M. Kenyon-Mathieu and Jeffrey Scott Vitter

pp. 807-823

BibTeX  Abstract Full Text:  PDF

Time Complexity of Boolean Functions on CREW PRAMs

Miroslaw Kutylowski

pp. 824-833

BibTeX  Abstract Full Text:  PDF

Embedding of Grids into Optimal Hypercubes

Mee Yee Chan

pp. 834-864

BibTeX  Abstract Full Text:  PDF

PP is as Hard as the Polynomial-Time Hierarchy

Seinosuke Toda

pp. 865-877

BibTeX  Abstract Full Text:  PDF

Selection Networks

Nicholas Pippenger

pp. 878-887

BibTeX  Abstract Full Text:  PDF

An Output-Sensitive Algorithm for Computing Visibility Graphs

Subir Kumar Ghosh and David M. Mount

pp. 888-910

BibTeX  Abstract Full Text:  PDF

Learning Simple Concepts under Simple Distributions

Ming Li and Paul M. B. Vitányi

pp. 911-935

BibTeX  Abstract Full Text:  PDF

On the Communication Complexity of Solving a Polynomial Equation

Zhi-Quan Luo and John N. Tsitsiklis

pp. 936-950

BibTeX  Abstract Full Text:  PDF

The Spectra of Infinite Hypertrees

Joel Friedman

pp. 951-961

BibTeX  Abstract Full Text:  PDF

On the Complexity of Learning Minimum Time-Bounded Turing Machines

Ker-I Ko

pp. 962-986

BibTeX  Abstract Full Text:  PDF

Minimum Diameter Spanning Trees and Related Problems

Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, and C. K. Wong

pp. 987-997

BibTeX  Abstract Full Text:  PDF

Erratum: Factoring Polynomials over Algebraic Number Fields

Susan Landau

p. 998

BibTeX  Abstract Full Text:  PDF